Some applications of algebra to combinatorics

نویسنده

  • Richard P. Stanley
چکیده

Stanley, R.P., Some applications of algebra to combinatorics, Discrete Applied Mathematics 34

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MULTIPLIERS AND THEIR APPLICATIONS IN EARTHQUAKE ENGINEERING

In this paper we shall study the multipliers on Banach algebras and We prove some results concerning Arens regularity and amenability of the Banach algebra M(A) of all multipliers on a given Banach algebra A. We also show that, under special hypotheses, each Jordan multiplier on a Banach algebra without order is a multiplier. Finally, we present some applications of m...

متن کامل

Some Combinatorial and Algorithmic Applications of the Borsuk-Ulam Theorem

The Borsuk-Ulam theorem has many applications in algebraic topology, algebraic geomtry, and combinatorics. Here we study some combinatorial consequences, typically asserting the existence of a certain combinatorial object. An interesting aspect is the computational complexity of algorithms that search for the object. The study of these algorithms is facilitated by direct combinatorial existence...

متن کامل

Reduction of Differential Equations by Lie Algebra of Symmetries

The paper is devoted to an application of Lie group theory to differential equations. The basic infinitesimal method for calculating symmetry group is presented, and used to determine general symmetry group of some differential equations. We include a number of important applications including integration of ordinary differential equations and finding some solutions of partial differential equa...

متن کامل

Six-vertex, Loop and Tiling Models: Integrability and Combinatorics

This is a review (including some background material) of the author’s work and related activity on certain exactly solvable statistical models in two dimensions, including the six-vertex model, loop models and lozenge tilings. Applications to enumerative combinatorics and to algebraic geometry are described.

متن کامل

Ranks of matrices with few distinct entries

An L-matrix is a matrix whose off-diagonal entries belong to a set L, and whose diagonal is zero. Let N(r, L) be the maximum size of a square L-matrix of rank at most r. Many applications of linear algebra in extremal combinatorics involve a bound on N(r, L). We review some of these applications, and prove several new results on N(r, L). In particular, we classify the sets L for which N(r, L) i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 34  شماره 

صفحات  -

تاریخ انتشار 1991